Delaunay triangulation

Results: 258



#Item
31

EuroCG’08, Nancy – March 18-20, 2008 A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron Nina Amenta∗ Dominique Attali†

Add to Reading List

Source URL: www.gipsa-lab.grenoble-inp.fr

Language: English - Date: 2012-12-15 14:15:54
    32

    Delaunay triangulation s I

    Add to Reading List

    Source URL: www.gipsa-lab.grenoble-inp.fr

    - Date: 2012-12-15 14:04:13
      33

      Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra. Nina Amenta UC Davis ∗

      Add to Reading List

      Source URL: www.gipsa-lab.grenoble-inp.fr

      Language: English - Date: 2010-02-08 13:19:02
        34

        Algorithmica manuscript No. (will be inserted by the editor) Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended Kevin Buchin · Maarten L¨offler · Pat Morin ·

        Add to Reading List

        Source URL: page.mi.fu-berlin.de

        Language: English - Date: 2016-02-21 01:18:49
          35Graph theory / Bipartite graphs / Geometric spanner / Shortest path problem / Planar graph / Tree / Delaunay triangulation / NP-complete problems / Planar separator theorem / Trapezoid graph

          Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood.

          Add to Reading List

          Source URL: www.ulb.ac.be

          Language: English - Date: 2011-02-08 09:21:41
          36

          A linear bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces Dominique Attali

          Add to Reading List

          Source URL: www.gipsa-lab.grenoble-inp.fr

          Language: English - Date: 2010-02-08 13:19:04
            37

            A linear bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces Dominique Attali Jean-Daniel Boissonnat May 5, 2003

            Add to Reading List

            Source URL: www.gipsa-lab.grenoble-inp.fr

            Language: English - Date: 2013-01-01 11:43:35
              38

              A fully distributed peer to peer structure based on 3D Delaunay Triangulation Moritz Steiner and Ernst Biersack Institut Eurecom, 2229, route des Crˆetes, 06904 Sophia-Antipolis, {moritz.steiner,ernst.biersack}@eurecom.

              Add to Reading List

              Source URL: www.e-biersack.eu

              Language: English - Date: 2012-10-03 06:40:35
                39Information science / Delaunay triangulation / Voronoi diagram / Priority queue / Z-order curve / Quadtree / Computational geometry / Point location / Nearest neighbor search / Triangulation / Geometry / Mathematics

                1 Introduction Triangulated spatial models and neighbourhood search: an experimental comparison

                Add to Reading List

                Source URL: users.cs.cf.ac.uk

                Language: English - Date: 2005-12-09 06:20:39
                40Topology / Pseudotriangle / Binary space partitioning / Convex hull / Collision detection / Steiner tree problem / Orientability / Leonidas J. Guibas / Delaunay triangulation / Geometry / Triangulation / Mathematics

                Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk

                Add to Reading List

                Source URL: www.cs.duke.edu

                Language: English - Date: 2011-12-02 14:30:54
                UPDATE